Location:
Search - prim algorithm
Search list
Description: 本程序是一个用prim算法寻找最小生成树的小程序。-this procedure is a prim with minimum spanning tree algorithm for small procedures.
Platform: |
Size: 76800 |
Author: 王 |
Hits:
Description: 最小生成树的prim算法
是求图中的最短路径的一个重要算法
但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
Platform: |
Size: 3072 |
Author: 袁文 |
Hits:
Description: 很有意思的网线布局的编程，用到了prim算法。完全原创！课程设计时的作品-very interesting line distribution network programming, a prim algorithm used. Completely original! Curriculum design works
Platform: |
Size: 305152 |
Author: 毕成功 |
Hits:
Description: 用普里姆(Prim)算法构造最小生成树 数据结构的基本应用，适合初学者-with Primbetov (PRIM), the minimum spanning tree algorithm tectonic structure of the basic data applications, suitable for beginners
Platform: |
Size: 2048 |
Author: 阿水 |
Hits:
Description: 图论算法库 C++ 语言实现
代码内容 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
语言 C++
编译平台 VisualAge C++ 4.0
作者 starfish (starfish.h@china.com)
备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Platform: |
Size: 10240 |
Author: 罗鹏魁 |
Hits:
Description: 我写的,画出最短路径,及最小生成树
Prim Dijistra算法+ GDI实现-I write to depict the shortest path, and the smallest Prim Dijistra Spanning Tree Algorithm to achieve GDI
Platform: |
Size: 1940480 |
Author: nick |
Hits:
Description: 数据结构中的Prim算法
本人自己编的
望大家给与支持-data structure of Prim algorithm I hope his series of the support we give
Platform: |
Size: 132096 |
Author: 周娜娜 |
Hits:
Description: prim算法Huffman算法Dijkstra算法和实验报告-prim algorithm Huffman algorithm Dijkstra algorithm and experimental report
Platform: |
Size: 759808 |
Author: maxiaowei |
Hits:
Description: Prim算法完整实现代码
用Prim算法求无向图的最小生成树
-Prim algorithm to achieve a complete code with Prim algorithm try to map the minimum spanning tree
Platform: |
Size: 3072 |
Author: 359369593 |
Hits:
Description:
数据结构中用普里姆(Prim)算法构造最小生成树 -Data structure using prim (Prim) Minimum Spanning Tree Algorithm
Platform: |
Size: 1024 |
Author: 王振兴 |
Hits:
Description: prim算法是从连通网中的某一个顶点开始，以此作为生成树的初始状态，然后不断的将网中的其他顶点添加到生成树上，直到最后一个顶点添加到生成数上时得到最小生成树．-prim algorithm is network connectivity from a vertex to start, as a spanning tree of the initial state, and then continuing to network other vertex added to the spanning tree until the last vertex added to the generated number to be the smallest when Spanning Tree.
Platform: |
Size: 8192 |
Author: 陈冰晶 |
Hits:
Description: Prim算法的实现，内容详见说明
开发环境为VS2003
-Prim algorithm, content development environment for the detailed description VS2003
Platform: |
Size: 6144 |
Author: 保密 |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.
Platform: |
Size: 105472 |
Author: 陈阳 |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.
Platform: |
Size: 28672 |
Author: 陈阳 |
Hits:
Description: 实现最小生成树算法,通过PRIM算法实现.通过输入一串字符显示最小生成树.求得最小路径-Realize minimum spanning tree algorithm, through the PRIM algorithm. By entering a string of characters show minimal spanning tree. Find the smallest path
Platform: |
Size: 5120 |
Author: 一一 |
Hits:
Description: 用prim算法实验最小生成树
本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树
定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。
定义二维数组g[ ][ ]来建立无向图的邻接矩阵。
-Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.
Platform: |
Size: 94208 |
Author: Tina612 |
Hits:
Description: prim算法,解决办公室通信埋线成本计算-prim algorithm, to solve the Office of Communications embedding costing
Platform: |
Size: 174080 |
Author: 邵逸风 |
Hits:
Description: 使用贪心算法实现PRIM最小生成树算法.经典的算法题目.-PRIM algorithm using the greedy algorithm for minimum spanning tree. Classic topics algorithm.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 基于Prim算法的公路交通设计系统，开发环境VC++,简单编码，供大家参考-Prim algorithm based on the design of highway transportation system, development environment VC++, Simple encoding, for your reference
Platform: |
Size: 43008 |
Author: 李雪 |
Hits:
Description: Prim算法，包括详细的容错机制，且可对非连通情况做处理。-Prim algorithm, including detailed fault-tolerant mechanism, and can be done to deal with the situation of non-connectivity.
Platform: |
Size: 1024 |
Author: 曹杨 |
Hits:
«
1
2
34
5
6
7
8
9
10
...
21
»